Generalisations of disjunctive sequences
نویسندگان
چکیده
منابع مشابه
Generalisations of disjunctive sequences
The present paper proposes a generalisation of the notion of disjunctive (or rich) sequence, that is, of an infinite sequence of letters having each finite sequence as a subword. Our aim is to give a reasonable notion of disjunctiveness relative to a given set of sequences F . We show that a definition like “every subword which occurs at infinitely many different positions in sequences in F has...
متن کاملCDMTCS Research Report Series Generalisations of Disjunctive Sequences
The present paper proposes a generalisation of the notion of disjunctive (or rich) sequence, that is, of an infinite sequence of letters having each finite sequence as a subword. Our aim is to give a reasonable notion of disjunc-tiveness relative to a given set of sequences F. We show that a definition like " every subword which occurs at infinitely many different positions in sequences in F ha...
متن کاملComplexity of Disjunctive Sequences
A sequence over an alphabet Σ is called disjunctive [13] if it contains all possible finite strings over Σ as its substrings. Disjunctive sequences have been recently studied in various contexts, e.g. [12, 9]. They abound in both category and measure senses [5]. In this paper we measure the complexity of a sequence x by the complexity of the language P (x) consisting of all prefixes of x. The l...
متن کاملSequences Classification by Least General Generalisations
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملSequences Classi cation by Least General Generalisations
In this paper, we present a general framework for supervised classi cation. This framework provides methods like boosting and only needs the de nition of a generalisation operator called lgg. For sequence classi cation tasks, lgg is a learner that only uses positive examples. We show that grammatical inference has already de ned such learners for automata classes like reversible automata or k-T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MLQ
سال: 2005
ISSN: 0942-5616,1521-3870
DOI: 10.1002/malq.200310130